/*
package demo.practice.leetcode_trie;

import demo.practice.leetcode.Trie;

import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class P212 {
    //太复杂，未做出来

    boolean isend=false;
    Map<Character,P212> children= new HashMap<>();

    public void insert(String word){
        P212 current= this;
        for (int i=0;i<word.length();i++ ) {
            char c = word.charAt(i);
            if(current.children.get(c)==null ){
                current.children.put(c,new P212());
            }
            current= current.children.get(c);
        }
        current.isend=true;
    }

    public List<String> findWords(char[][] board, String[] words) {
        Trie trie = new Trie();
        for(String word:words){
            trie.insert(word);
        }


    }


    public List<String>  findWords(char[][] board){

        for(int i=0;i<board.length;i++){
            char[] ch=board[i];
            for(int j=0;j<board.length;j++){
                char thischar=board[i][j];
                P212 current=this;
                if(current.children.get(thischar)!=null){

                }
            }
        }
    }

    private  void findWords()

}
*/
